Computational experience with general equilibrium problems

نویسندگان

  • Achim Bachem
  • Winfried Hochstättler
  • Barthel Steckemetz
  • A. Volmer
چکیده

We report on computational experience with an implementation of three algorithms for the general economic equilibrium problem. As a result we get that the projection algorithm for variational inequalities increases the size of solvable models by a factor of 5-10 in comparison with the classical homotopy method. As a third approach we implemented a simulated annealing heuristic which might be suitable to estimate equilibria for very large models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient method for the numerical solution of Helmholtz type general two point boundary value problems in ODEs

In this article, we propose and analyze a computational method for numerical solution of general two point boundary value problems. Method is tested on problems to ensure the computational eciency. We have compared numerical results with results obtained by other method in literature. We conclude that propose method is computationally ecient and eective.

متن کامل

Strong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings

We introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...

متن کامل

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

In this paper computational results are presented with a very general, yet powerful backtracking procedure for solving the duration minimization and net present value maximization problems in a precedence and resource-constrained network. These networks are generally of the PERT/CPM variety, although it is not required that they be so. Among the advantages cited for our approach are low compute...

متن کامل

Estimation of Concentrations in Chemical Systems at Equilibrium Using Geometric Programming

Geometric programming is a mathematical technique, which has been developed for nonlinear optimization problems. This technique is based on the dual program with linear constraints. Determination of species concentrations in chemical equilibrium conditions is one of its applications in chemistry and chemical engineering fields. In this paper, the principles of geometric programming and its comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1996